Isosingular Sets and Deflation

نویسندگان

  • Jonathan D. Hauenstein
  • Charles W. Wampler
چکیده

This article introduces the concept of isosingular sets, which are irreducible algebraic subsets of the set of solutions to a system of polynomial equations that share a common singularity structure. The definition of these sets depends on deflation, a procedure that uses differentiation to regularize solutions. A weak form of deflation has proven useful in regularizing algebraic sets, making them amenable to treatment by the algorithms of numerical algebraic geometry. We introduce a strong form of deflation and define deflation sequences, which are similar to the sequences arising in Thom-Boardman singularity theory. We then define isosingular sets in terms of deflation sequences. We also define the isosingular local dimension and examine the properties of isosingular sets. While isosingular sets are of theoretical interest as constructs for describing singularity structures of algebraic sets, they also expand the kinds of algebraic sets that can be investigated with methods from numerical algebraic geometry.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Bertini_real: Software for One- and Two-Dimensional Real Algebraic Sets

Bertini real is a command line program for numerically decomposing the real portion of a oneor two-dimensional complex irreducible algebraic set in any reasonable number of variables. Using numerical homotopy continuation to solve a series of polynomial systems via regeneration from a witness set, a set of real vertices is computed, along with connection information and associated homotopy func...

متن کامل

On Computing a Cell Decomposition of a Real Surface Containing Infinitely Many Singularities

Numerical algorithms for decomposing the real points of a complex curve or surface in any number of variables have been developed and implemented in the new software package Bertini real. These algorithms use homotopy continuation to produce a cell decomposition. The previously existing algorithm for surfaces is restricted to the “almost smooth” case, i.e., the given surface must contain only f...

متن کامل

Numerically intersecting algebraic varieties via witness sets

The fundamental construct of numerical algebraic geometry is the representation of an irreducible algebraic set, A, by a witness set, which consists of a polynomial system, F , for which A is an irreducible component of V(F ), a generic linear space L of complementary dimension to A, and a numerical approximation to the set of witness points, L ∩A. Given F , methods exist for computing a numeri...

متن کامل

Statistical validity of using ratio variables in human kinetics research.

The purposes of this study were to investigate the validity of the simple ratio and three alternative deflation models and examine how the variation of the numerator and denominator variables affects the reliability of a ratio variable. A simple ratio and three alternative deflation models were fitted to four empirical data sets, and common criteria were applied to determine the best model for ...

متن کامل

Certifying solutions to overdetermined and singular polynomial systems over Q

This paper is concerned with certifying that a given point is near an exact root of an overdetermined or singular polynomial system with rational coefficients. The difficulty lies in the fact that consistency of overdetermined systems is not a continuous property. Our certification is based on hybrid symbolic-numeric methods to compute the exact rational univariate representation (RUR) of a com...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Foundations of Computational Mathematics

دوره 13  شماره 

صفحات  -

تاریخ انتشار 2013